基于增广Lagrange函数的RQP方法

Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported.     

电信运营市场上过度进入的供给分析

本文在分析光纤主干网和本地接入服务市场上电信运营商的供给行为的基础上,首先证明了拥有主干网的运营商愿意租出自己的部分光纤,接着分析证明了上述两市场上使投资更倾向于过度的乘数效应,并进一步证明网络外部性使乘数效应更加明显.旨在对我国电信运营市场发展给出一些参考意见.     

强色指数的一个新的上界

给出了图的强色指数的一个新的上界，并指出几类恰好达到该上界的图，从而改进了Erodoes和Nesetri的强色指数猜想，在某种意义上证明了这个猜想。     

Slutsky定理在样本分位数的极限分布证明上的应用

为了更好地理解和应用样本分位数的极限分布,利用Slutsky定理,推导了样本分位数的极限分布.     

环上半线性椭圆型方程正解的存在性和唯一性

本文讨论了半线性椭圆方程△u+f(u)=0在三种边界条件下正解的存在性和唯一性,给出了正解存在和唯一的一些条件.     

On co-semihereditary rings

A ringR is left co-semihereditary (strongly left co-semihereditary) if every finitely cogenerated factor of a finitely cogenerated (arbitrary) injective leftR-module is injective. A left co-semihereditary ring, which is not strongly left co-semihereditary, is given to answer a question of Miller and Tumidge in the negative. If _R U _S defines a Morita duality,R is proved to be left co-semihereditary (left semihereditmy) if and only ifS is right semihereditary (right co-semihereditary). Assuming thatS⩾R is an almost excellent extension,S is shown to be (strongly) right co-semihereditary if and only ifR is (strongly) right co-semihereditary. Project supported by the National Natural Science Foundation of China.     

Protein Conformation of a Lattice Model Using Tabu Search

We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model.     

核磁共振弛豫速率方法测定模拟正铁色素的结构

在生命体系内正铁色素具有摄铁和输铁的功能,人工合成的模拟化合物具备了正铁色素的主要功能基团和相近的性质.本工作利用铁(Ⅲ)离子的顺磁性质,测定不同铁(Ⅲ)离子浓度下模拟正铁色素的诱导弛豫时间,根据简化了的Solomon—B1oemoergen公式,计算出铁(Ⅲ)离子到所有被测质子(即氢原子)的相对距离,比较清楚地得到模拟正铁色素在溶液中的构象。     

Global optimization design of quasi-optics fower combiner of solid-state millimeter wave resonator

This paper describes a global optimization design of quasi-optics power combiner of solid-state millimeterwave resonator. It is operated in the frequency range from 50 to 300 GHz using GaAs Gunn diodes. It is shown that sourcearrays containing N² (N=3,5,...2K+1, where k is positive integer) individual elements. It is very efficient power transfer of energy from the source-array to the fractional power of the fundamental beam mode etc.. The RF output power exceeded the sum of the individual diodes to be threefold to sevenfold. And this data is the global optimization solution.